Implementing Propagators for Tabular Constraints
نویسندگان
چکیده
Many real-life constraints describing relations between the problem variables have complex semantics and the constraint domain is defined using a table of compatible tuples rather than using a formula. In the paper we study the implementation of filtering algorithms (propagators) for such tabular constraints. We concentrate on implementation aspects of these algorithms so the proposed propagators can be naturally integrated into existing constraint satisfaction packages like SICStus Prolog.
منابع مشابه
Generating Propagators for Finite Set Constraints
Ideally, programming propagators as implementations of constraints should be an entirely declarative specification process for a large class of constraints: a high-level declarative specification is automatically translated into an efficient propagator. This paper introduces the use of existential monadic secondorder logic as declarative specification language for finite set propagators. The ap...
متن کاملConstraint Propagation
This dissertation presents the design of a propagation-based constraint solver. The design is based on models that span several levels of abstraction, ranging from a mathematical foundation, to a high-level implementation architecture, to concrete data structures and algorithms. This principled design approach results in a wellunderstood, correct, modular, and hence efficient implementation. Th...
متن کاملTR-2006013: The Dom Event and Its Use in Implementing Constraint Propagators
This paper argues the usefulness of the dom event in programming several constraint propagators. The dom event is introduced for implementing the AC-4 algorithm. For a binary constraint, whenever a value is excluded from the domain of a variable, the propagator with the dom event can locate the no-good values in the domain of the other variable in constant time. In this paper we present three a...
متن کاملFinite Domain Bounds Consistency Revisited
A widely adopted approach to solving constraint satisfaction problems combines systematic tree search with constraint propagation for pruning the search space. Constraint propagation is performed by propagators implementing a certain notion of consistency. Bounds consistency is the method of choice for building propagators for arithmetic constraints and several global constraints in the finite ...
متن کاملDynamic Analysis of Bounds Versus Domain Propagation
Constraint propagation solvers interleave propagation (removing impossible values from variable domains) with search. Previously, Schulte and Stuckey introduced the use of static analysis to determine where in a constraint program domain propagators can be replaced by more efficient bounds propagators and still ensure that the same search space is traversed. This paper introduces a dynamic yet ...
متن کامل